17 research outputs found

    Results of the test of laser boronizing of machine elements made of gray cast iron

    No full text
    W pracy przedstawiono badania zmierzające do opanowania technologii borowania laserowego elementów wykonanych z żeliwa szarego. Warstwy powierzchniowe wykonane tą technologią cechują się znaczną mikrotwardością i tym samym dużą odpornością na zużycie tribologiczne.This paper presents the research on establishing a laser boronizing technology of machine elements made of gray cast iron. Significant microhardness and following high tribological resistance are characteristic for surface layers created with the use of this technology

    The structural defects of laser treated zones of cast iron elements and the way of eliminating of them

    No full text
    Przedstawiono wyniki badań powierzchniowej obróbki laserowej przeprowadzonej na trzech różnych rodzajach żeliw (szare, sferoidalne i stopowe). Badania wykazały możliwość powstawania licznych wad w strukturze warstwy powierzchniowej tworzonej w wyniku obróbki laserowej. Zeprezentowano również wyniki badań obróbki laserowej przeprowadzonej dla żeliwa sferoidalnego, w których warunki obróbki pozwaliby uniknąć wad w postaci pęknięć.The paper presents findings of surface laser treatment of three different kinds of cast iron (gray, ductile and alloy). Research revealed appearance of numerous defects of surface layer structure created by means of laser treatment. Results of studies over ductile cast iron laser treatment with processing conditions allowing to avoid defects in the form of cracks have been also shown

    Discrete-continuous project scheduling with preemptable activities

    No full text
    In this paper, discrete-continuous project scheduling problems with preemptable activities are considered. In these problems, activities of a project simultaneously require discrete and continuous resources for their execution. The activities are preemptable, and the processing rate of each activity is a continuous, increasing function of the amount of a single continuous resource allotted to the activity at a time. The problem is to find a precedence- and discrete resource-feasible schedule and, simultaneously, continuous resource allocation that would minimize the project duration. Convex and concave processing rate functions are considered separately. We show that for convex functions the problem is simple, whereas for concave functions a special methodology has to be developed. We discuss the methodology for three cases of the problem: no discrete resource constraints, one discrete resource being a set of parallel, identical machines, and an arbitrary number of discrete resources. In each case we analyze separately independent and precedence-related activities. Some conclusions and directions for future research are given

    Scheduling preemptable jobs on identical processors under varying availability of an additional continuous resource

    No full text
    In this work we consider a problem of scheduling preemptable, independent jobs, characterized by the fact that their processing speeds depend on the amounts of a continuous, renewable resource allocated to jobs at a time. Jobs are scheduled on parallel, identical machines, with the criterion of minimization of the schedule length. Since two categories of resources occur in the problem: discrete (set of machines) and continuous, it is generally called a discrete-continuous scheduling problem. The model studied in this paper allows the total available amount of the continuous resource to vary over time, which is a practically important generalization that has not been considered yet for discrete-continuous scheduling problems. For this model we give some properties of optimal schedules on a basis of which we propose a general methodology for solving the considered class of problems. The methodology uses a two-phase approach in which, firstly, an assignment of machines to jobs is defined and, secondly, for this assignment an optimal continuous resource allocation is found by solving an appropriate mathematical programming problem. In the approach various cases are considered, following from assumptions made on the form of the processing speed functions of jobs. For each case an iterative algorithm is designed, leading to an optimal solution in a finite number of steps

    General Characteristics of the Article as a Genre of Political Discourse

    No full text
    В статье рассматриваются основные черты, позволяющие представить специфику статьи в российской политической коммуникации.The paper analyzes the article as a genre variety of modern political discourse. The purpose of the study is to classify and describe the main features that allow the researcher to present the specificity of the article in Russian political communication

    Scheduling battery charging jobs with linearly decreasing power demands to minimize the total time

    No full text
    In this work we consider a problem from the field of power- and energy-aware scheduling, in which a set of batteries have to be charged in a minimum time. The formulated problem is to schedule independent and nonpreemptable jobs to minimize the schedule length, where each job requires some amount of power and consumes a certain amount of energy during its processing. We assume that the power demand of each job linearly decreases with time, as it is the case when Li-ion batteries are being charged. For the assumed job model we prove that each next job should be started as soon as the required amount of power is available. Basing on the proven theorem we formulate a procedure generating a minimum-length schedule for an assumed order of jobs. We also analyze the case of identical jobs, and show some interesting properties of this case

    How informative were early SARS-CoV-2 treatment and prevention trials? a longitudinal cohort analysis of trials registered on ClinicalTrials.gov

    No full text
    BACKGROUND: Early in the SARS-CoV-2 pandemic, commentators warned that some COVID trials were inadequately conceived, designed and reported. Here, we retrospectively assess the prevalence of informative COVID trials launched in the first 6 months of the pandemic. METHODS: Based on prespecified eligibility criteria, we created a cohort of Phase 1/2, Phase 2, Phase 2/3 and Phase 3 SARS-CoV-2 treatment and prevention efficacy trials that were initiated from 2020-01-01 to 2020-06-30 using ClinicalTrials.gov registration records. We excluded trials evaluating behavioural interventions and natural products, which are not regulated by the U.S. Food and Drug Administration (FDA). We evaluated trials on 3 criteria of informativeness: potential redundancy (comparing trial phase, type, patient-participant characteristics, treatment regimen, comparator arms and primary outcome), trials design (according to the recommendations set-out in the May 2020 FDA guidance document on SARS-CoV-2 treatment and prevention trials) and feasibility of patient-participant recruitment (based on timeliness and success of recruitment). RESULTS: We included all 500 eligible trials in our cohort, 58% of which were Phase 2 and 84.8% were directed towards the treatment of SARS-CoV-2. Close to one third of trials met all three criteria and were deemed informative (29.9% (95% Confidence Interval 23.7–36.9)). The proportion of potentially redundant trials in our cohort was 4.1%. Over half of the trials in our cohort (56.2%) did not meet our criteria for high quality trial design. The proportion of trials with infeasible patient-participant recruitment was 22.6%. CONCLUSIONS: Less than one third of COVID-19 trials registered on ClinicalTrials.gov during the first six months met all three criteria for informativeness. Shortcomings in trial design, recruitment feasibility and redundancy reflect longstanding weaknesses in the clinical research enterprise that were likely amplified by the exceptional circumstances of a pandemic

    Competition for recruitment in SARS-CoV-2 Trials in the United States : a longitudinal cohort analysis

    No full text
    Abstract Objective Competition among trials for patient enrollment can impede recruitment. We hypothesized that this occurred early in the COVID-19 pandemic, when an unprecedented number of clinical trials were launched. We performed a simple and multivariable regression analysis evaluating the relationship between the proportion of SARS-CoV-2 investigational trial sites within each USA state with unsuccessful patient-participant recruitment and: (i) the proportion of cases required to reach state recruitment goals; (ii) state population based on data from the US Census; and, (iii) number of trial sites per state. Results Our study included 151 clinical trials. The proportion of trials with successful recruitment was 72.19% (109 of 151 trials). We did not find a significant relationship between unsuccessful patient-participant recruitment, state recruitment goals, state population or the number of trial sites per state in both our simple and multivariable regression analyses. Our results do not suggest that early in the COVID-19 pandemic, competition for patient-participants impeded successful recruitment in SARS-CoV-2 trials. This may reflect the unique circumstances of the first few months of the pandemic in the United States, in which the number and location of SARS-CoV-2 cases was sufficient to meet trial recruitment requirements, despite the large number of trials launched
    corecore